Convolution and Square in Abelian Groups I
نویسندگان
چکیده
We prove that the functional equation f⋆f(2 t)=λf(t)2, for t in Z/dZ with d odd, admits a nonzero solution f if λ=a+ib a, b positive integers such a+b=d and a≡(d+1)24 mod 4. The proof involves theta functions on elliptic curves complex multiplication.
منابع مشابه
New negative Latin square type partial difference sets in nonelementary abelian 2-groups and 3-groups
A partial difference set having parameters (n2, r(n− 1), n+ r2 − 3r, r2 − r) is called a Latin square type partial difference set, while a partial difference set having parameters (n2, r(n+1),−n+r2+3r, r2+r) is called a negative Latin square type partial difference set. Nearly all known constructions of negative Latin square partial difference sets are in elementary abelian groups. In this pape...
متن کاملTheory of Square-like Abelian Groups Is Decidable
A group is called square-like if it is universally equivalent to its direct square. It is known that the class of all square-like groups admits an explicit first order axiomatization but its theory is undecidable. We prove that the theory of square-like abelian groups is decidable. This answers a question posed by D. Spellman.
متن کاملnon-divisibility for abelian groups
Throughout all groups are abelian. We say a group G is n-divisible if nG = G. If G has no non-zero n-divisible subgroups for all n>1 then we say that G is absolutely non-divisible. In the study of class C consisting all absolutely non-divisible groups such as G, we come across the sub groups T_p(G) = the sum of all p-divisible subgroups and rad_p(G) = the intersection of all p^nG. The proper...
متن کاملQuantum Error-Correction Codes on Abelian Groups
We prove a general form of bit flip formula for the quantum Fourier transform on finite abelian groups and use it to encode some general CSS codes on these groups.
متن کاملAbelian-square-rich words
An abelian square is the concatenation of two words that are anagrams of one another. A word of length n can contain at most Θ(n) distinct factors, and there exist words of length n containing Θ(n) distinct abelian-square factors, that is, distinct factors that are abelian squares. This motivates us to study infinite words such that the number of distinct abelian-square factors of length n grow...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Experimental Mathematics
سال: 2023
ISSN: ['1944-950X', '1058-6458']
DOI: https://doi.org/10.1080/10586458.2023.2174212